Apparatuses and methods for rating the quality of a posting

ABSTRACT

Aspects relate to apparatuses and methods for rating the quality of a posting. An exemplary apparatus includes at least a processor and a memory communicatively connected to the processor, the memory containing instructions configuring the processor to acquire a plurality of inputs from at least a posting, classify the posting to a posting category as a function of the plurality of inputs, calculate a quality metric as a function of the posting category and the plurality of inputs, wherein the quality metric reflects a level of completeness regarding the arrangement of inputs in a posting, and generate, as a function of the quality metric, a ordering of the posting, wherein the order relates to a probable level of focus a user may use to fill the posting.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of Nonprovisional application Ser. No. 17/667,611, filed on Feb. 9, 2022, and entitled “APPARATUSES AND METHODS FOR RATING THE QUALITY OF A POSTING,” the entirety of which is incorporated herein by reference.

FIELD OF THE INVENTION

The present invention relates to the field of human resource technology. In particular, the present invention is directed to apparatuses and methods for rating the quality of a posting.

BACKGROUND

Current ways of rating postings do not give enough insight on metrics concerning the quality and desirability of a posting.

SUMMARY OF THE DISCLOSURE

In an aspect, an apparatus for rating the quality of a posting is illustrated. The apparatus includes at least a processor and a memory communicatively connected to the processor, the memory containing instructions configuring the processor to acquire a plurality of inputs from at least a posting associated with a job position, classify the posting to a posting category as a function of the plurality of inputs, calculate a quality metric as a function of the posting category and the plurality of inputs, wherein the quality metric reflects a level of completeness regarding the arrangement of inputs in a posting, and generate, as a function of the quality metric, a ordering of the posting, wherein the order relates to a probable level of focus.

In an aspect, a method for rating the quality of a posting is illustrated. The method includes using a computing device to acquire a plurality of inputs from at least a posting associated with a job position, classify the posting to a posting category as a function of the plurality of inputs, calculate a quality metric as a function of the posting category and the plurality of inputs, wherein the quality metric reflects a level of completeness regarding the arrangement of inputs in a posting, and generate, as a function of the quality metric, a ordering of the posting, wherein the order relates to a probable level of focus.

These and other aspects and features of non-limiting embodiments of the present invention will become apparent to those skilled in the art upon review of the following description of specific non-limiting embodiments of the invention in conjunction with the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

For the purpose of illustrating the invention, the drawings show aspects of one or more embodiments of the invention. However, it should be understood that the present invention is not limited to the precise arrangements and instrumentalities shown in the drawings, wherein:

FIG. 1 is a block diagram of an embodiment of an apparatus for rating the quality of a posting;

FIG. 2 is a block diagram of exemplary embodiment of a machine learning module;

FIG. 3 illustrates an exemplary nodal network;

FIG. 4 is a block diagram of an exemplary node;

FIG. 5 is a graph illustrating an exemplary relationship between fuzzy sets;

FIG. 6 is a flow diagram of an exemplary method for rating the quality of a posting;

FIG. 7 is a block diagram of a computing system that can be used to implement any one or more of the methodologies disclosed herein and any one or more portions thereof.

The drawings are not necessarily to scale and may be illustrated by phantom lines, diagrammatic representations and fragmentary views. In certain instances, details that are not necessary for an understanding of the embodiments or that render other details difficult to perceive may have been omitted.

DETAILED DESCRIPTION

At a high level, aspects of the present disclosure are directed to apparatuses and methods for rating the quality of a posting. In an embodiment, a posting may be a job posting from an employer or job matching entity.

Aspects of the present disclosure can be utilized by job recruiters and/or staffing agencies to know which job postings to focus their energy and time on filling first and which ones may take longer to fill and may require a more in-depth search for a particular job candidate.

Exemplary embodiments illustrating aspects of the present disclosure are described below in the context of several specific examples.

Referring now to FIG. 1 , an exemplary embodiment of apparatus 100 for rating the quality of posting 116 is illustrated. Apparatus 100 includes processor 104 and memory 108 communicatively connected to processor 104, wherein memory 108 contains instructions configuring processor 104 to carry out the rating process. In some embodiments, apparatus 100 may include computing device 112. Apparatus 100 may be communicatively connected to computing device 112. As used in this disclosure, “communicatively connected” means connected by way of a connection, attachment or linkage between two or more relata which allows for reception and/or transmittance of information therebetween. For example, and without limitation, this connection may be wired or wireless, direct or indirect, and between two or more components, circuits, devices, systems, and the like, which allows for reception and/or transmittance of data and/or signal(s) therebetween. Data and/or signals therebetween may include, without limitation, electrical, electromagnetic, magnetic, video, audio, radio and microwave data and/or signals, combinations thereof, and the like, among others. A communicative connection may be achieved, for example and without limitation, through wired or wireless electronic, digital or analog, communication, either directly or by way of one or more intervening devices or components. Further, communicative connection may include electrically coupling or connecting at least an output of one device, component, or circuit to at least an input of another device, component, or circuit. For example, and without limitation, via a bus or other facility for intercommunication between elements of a computing device. Communicative connecting may also include indirect connections via, for example and without limitation, wireless connection, radio communication, low power wide area network, optical communication, magnetic, capacitive, or optical coupling, and the like. In some instances, the terminology “communicatively coupled” may be used in place of communicatively connected in this disclosure. Computing device 112 may include any computing device as described in this disclosure, including without limitation a microcontroller, microprocessor, digital signal processor (DSP) and/or system on a chip (SoC) as described in this disclosure. Computing device 112 may include, be included in, and/or communicate with a mobile device such as a mobile telephone or smartphone. Computing device 112 may include a single computing device operating independently, or may include two or more computing device operating in concert, in parallel, sequentially or the like; two or more computing devices may be included together in a single computing device or in two or more computing devices. Computing device 112 may interface or communicate with one or more additional devices as described below in further detail via a network interface device. Network interface device may be utilized for connecting computing device 112 to one or more of a variety of networks, and one or more devices. Examples of a network interface device include, but are not limited to, a network interface card (e.g., a mobile network interface card, a LAN card), a modem, and any combination thereof. Examples of a network include, but are not limited to, a wide area network (e.g., the Internet, an enterprise network), a local area network (e.g., a network associated with an office, a building, a campus or other relatively small geographic space), a telephone network, a data network associated with a telephone/voice provider (e.g., a mobile communications provider data and/or voice network), a direct connection between two computing devices, and any combinations thereof. A network may employ a wired and/or a wireless mode of communication. In general, any network topology may be used. Information (e.g., data, software etc.) may be communicated to and/or from a computer and/or a computing device. Computing device 112 may include but is not limited to, for example, a computing device or cluster of computing devices in a first location and a second computing device or cluster of computing devices in a second location. Computing device 112 may include one or more computing devices dedicated to data storage, security, distribution of traffic for load balancing, and the like. Computing device 112 may distribute one or more computing tasks as described below across a plurality of computing devices of computing device, which may operate in parallel, in series, redundantly, or in any other manner used for distribution of tasks or memory between computing devices. Computing device 112 may be implemented using a “shared nothing” architecture in which data is cached at the worker, in an embodiment, this may enable scalability of apparatus 100 and/or computing device 112.

With continued reference to FIG. 1 , processor 104 and/or computing device 112 may be designed and/or configured by memory 108 to perform any method, method step, or sequence of method steps in any embodiment described in this disclosure, in any order and with any degree of repetition. For instance, processor 104 and/or computing device 112 may be configured to perform a single step or sequence repeatedly until a desired or commanded outcome is achieved; repetition of a step or a sequence of steps may be performed iteratively and/or recursively using outputs of previous repetitions as inputs to subsequent repetitions, aggregating inputs and/or outputs of repetitions to produce an aggregate result, reduction or decrement of one or more variables such as global variables, and/or division of a larger processing task into a set of iteratively addressed smaller processing tasks. Processor 104 and/or computing device 112 may perform any step or sequence of steps as described in this disclosure in parallel, such as simultaneously and/or substantially simultaneously performing a step two or more times using two or more parallel threads, processor cores, or the like; division of tasks between parallel threads and/or processes may be performed according to any protocol suitable for division of tasks between iterations. Persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of various ways in which steps, sequences of steps, processing tasks, and/or data may be subdivided, shared, or otherwise dealt with using iteration, recursion, and/or parallel processing.

With continued reference to FIG. 1 , processor 104 and/or computing device 112 is configured to rate the quality of posting 116. As used in this disclosure, a “posting” is information provided by a person of entity disclosing work opportunities, qualifications, and employment procedures. Posting 106 may be in variety of formats, for example, ads, contracts, sponsorships, and the like. Processor 104 and/or computing device 112 is configured to acquire a plurality of inputs 120 from posting 116. As used in this disclosure, “input” is data contained within a posting. In some embodiments, inputs 120 from posting 116, may include a job title, job requirements, salary, and geographic location. The job requirements may be the qualifications that are needed for the job. The job requirements may include educational requirements. For example, the educational requirements may include degree level (GED, Bachelor's, Master's and the like) or degree field (electrical engineering, business, biology, and the like). The job requirements may include years of experience and an hour requirement, wherein the hour requirement is the number of hours that an applicant would be required to work. The job requirements may also be mandatory, optional, or preferred. In some embodiments, the salary may be expressed in an annual rate, hourly rate, lump sum, and the like. The salary may be a discrete number (e.g., $80,000) or it may be a range (e.g., $75,000-$90,000). In some embodiments, the geographic location may include, for example a location of an office, or the geographic location may include “remote” or “at home”.

Still referring to FIG. 1 , processor 104 and/or computing device 112 may receive a plurality of inputs 120 from posting 116 using a natural language processing module, as described in more detail below, to extract data from a received posting 116. For example, the module may be used to extract the job requirements, title, location, and the like from posting 116. In some embodiments, posting 116 may be received by downloading data from a network as described throughout this disclosure. For example, user may upload posting 116 to a network in which processor 104 and/or computing device 112 may be configured to retrieve data from. As used in this disclosure, a “user” is an employer or hiring entity.

Still referring to FIG. 1 . processor 104 and/or computing device 112 is configured to classify posting 116 to posting category 128 as a function of a plurality of inputs 120. As used in this disclosure, a “posting category” is a grouping of inputs in a posting, as previously defined, based on specific textual relations to a sector of information. In some embodiments, a posting category may group input associated with job titles, salaries, locations, experience, technological backgrounds, and the like from posting 116. For example, inputs in posting 116 such as “65 k starting salary”, “20 k signing bonus” and “Gas Mileage Reimbursement” may be grouped into a salary posting category.

Processor 104 and/or computing device 112 may perform determinations, classification, and/or analysis steps, methods, processes, or the like as described in this disclosure using machine learning processes 124. A “machine learning process,” as used in this disclosure, is a process that automatedly uses a body of data known as “training data” and/or a “training set” to generate an algorithm that will be performed by processor 104 and/or computing device 112/module to produce outputs given data provided as inputs; this is in contrast to a non-machine learning software program where the commands to be executed are determined in advance by a user and written in a programming language.” Processor 104 and/or computing device 112 may use classifier 132 to match an input from posting 116 to a particular posting category 128. A “classifier,” as used in this disclosure is a machine-learning model, such as a mathematical model, neural net, or program generated by a machine learning algorithm known as a “classification algorithm,” as described in further detail below, that sorts inputs into categories or bins of data, outputting the categories or bins of data and/or labels associated therewith. Classifier 132 may be configured to output at least a datum that labels or otherwise identifies a set of data that are clustered together, found to be close under a distance metric as described below, or the like. For example, the plurality of inputs from posting 116 may be the classifier inputs that get outputted to a plurality of posting categories outputs. In some embodiments, classifier training data may include posting database 136, wherein database 136 includes a plurality of input entries of postings. Classifier training data may also include sample posting categories from a plurality of postings. Classification may be performed using, without limitation, linear classifiers such as without limitation logistic regression and/or naive Bayes classifiers, nearest neighbor classifiers such as k-nearest neighbors classifiers, support vector machines, least squares support vector machines, fisher's linear discriminant, quadratic classifiers, decision trees, boosted trees, random forest classifiers, learning vector quantization, and/or neural network-based classifiers.

Still referring to FIG. 1 , processor 104 and/or computing device 112 may be configured to generate classifier 132 using a Naïve Bayes classification algorithm. Naïve Bayes classification algorithm generates classifiers by assigning class labels to problem instances, represented as vectors of element values. Class labels are drawn from a finite set. Naïve Bayes classification algorithm may include generating a family of algorithms that assume that the value of a particular element is independent of the value of any other element, given a class variable. Naïve Bayes classification algorithm may be based on Bayes Theorem expressed as P(A/B)=P(B/A) P(A)−P(B), where P(A/B) is the probability of hypothesis A given data B also known as posterior probability; P(B/A) is the probability of data B given that the hypothesis A was true; P(A) is the probability of hypothesis A being true regardless of data also known as prior probability of A; and P(B) is the probability of the data regardless of the hypothesis. A naïve Bayes algorithm may be generated by first transforming training data into a frequency table. Processor 104 and/or computing device 112 may then calculate a likelihood table by calculating probabilities of different data entries and classification labels. Processor 104 and/or computing device 112 may utilize a naïve Bayes equation to calculate a posterior probability for each class. A class containing the highest posterior probability is the outcome of prediction. Naïve Bayes classification algorithm may include a gaussian model that follows a normal distribution. Naïve Bayes classification algorithm may include a multinomial model that is used for discrete counts. Naïve Bayes classification algorithm may include a Bernoulli model that may be utilized when vectors are binary.

With continued reference to FIG. 1 , processor 104 and/or computing device 112 may be configured to generate classifier 132 using a K-nearest neighbors (KNN) algorithm. A “K-nearest neighbors algorithm” as used in this disclosure, includes a classification method that utilizes feature similarity to analyze how closely out-of-sample-features resemble training data to classify input data to one or more clusters and/or categories of features as represented in training data; this may be performed by representing both training data and input data in vector forms, and using one or more measures of vector similarity to identify classifications within training data, and to determine a classification of input data. K-nearest neighbors algorithm may include specifying a K-value, or a number directing the classifier to select the k most similar entries training data to a given sample, determining the most common classifier of the entries in the database, and classifying the known sample; this may be performed recursively and/or iteratively to generate a classifier that may be used to classify input data as further samples. For instance, an initial set of samples may be performed to cover an initial heuristic and/or “first guess” at an output and/or relationship, which may be seeded, without limitation, using expert input received according to any process as described herein. As a non-limiting example, an initial heuristic may include a ordering of associations between inputs and elements of training data. Heuristic may include selecting some number of highest-ordering associations and/or training data elements.

With continued reference to FIG. 1 , generating k-nearest neighbors algorithm may generate a first vector output containing a data entry cluster, generating a second vector output containing an input data, and calculate the distance between the first vector output and the second vector output using any suitable norm such as cosine similarity, Euclidean distance measurement, or the like. Each vector output may be represented, without limitation, as an n-tuple of values, where n is at least two values. Each value of n-tuple of values may represent a measurement or other quantitative value associated with a given category of data, or attribute, examples of which are provided in further detail below; a vector may be represented, without limitation, in n-dimensional space using an axis per category of value represented in n-tuple of values, such that a vector has a geometric direction characterizing the relative quantities of attributes in the n-tuple as compared to each other. Two vectors may be considered equivalent where their directions, and/or the relative quantities of values within each vector as compared to each other, are the same; thus, as a non-limiting example, a vector represented as [5, 10, 15] may be treated as equivalent, for purposes of this disclosure, as a vector represented as [1, 2, 3]. Vectors may be more similar where their directions are more similar, and more different where their directions are more divergent; however, vector similarity may alternatively or additionally be determined using averages of similarities between like attributes, or any other measure of similarity suitable for any n-tuple of values, or aggregation of numerical similarity measures for the purposes of loss functions as described in further detail below. Any vectors as described herein may be scaled, such that each vector represents each attribute along an equivalent scale of values. Each vector may be “normalized,” or divided by a “length” attribute, such as a length attribute l as derived using a Pythagorean norm: l=√{square root over (Σ_(i=0) ^(n)a_(i) ²)}, where a_(i) is attribute number i of the vector. Scaling and/or normalization may function to make vector comparison independent of absolute quantities of attributes, while preserving any dependency on similarity of attributes; this may, for instance, be advantageous where cases represented in training data are represented by different quantities of samples, which may result in proportionally equivalent vectors with divergent values.

Still referring to FIG. 1 . Processor 104 and/or computing device 112 is configured to calculate quality metric 140 as a function of posting category 128 and a plurality of inputs 120. As used in this disclosure, a “quality metric” is a mechanism configured to provide a numerical value to inputs, wherein quality metric 140 reflects a level of completeness regarding an arrangement of inputs 120 in posting 116.

In some embodiments, calculating quality metric 140 includes using machines learning processes 124 to calculate and combine a plurality of sub-quantifiers of posting 116 based on a desirability criterion. As used in this disclosure, a “desirability criterion” is a criterion that indicates the appeal of posting 116 to an applicant, wherein the applicant is a job seeker that would reply to posting 116. For example, the desirability of the job posting may be based on desirability criteria including salary, benefits, hours, location of the job posting compared to other comparable job postings. In some cases, the desirability of posting 116 may depend at least in part on the company that posted posting 116. In some embodiments, machine learning process 124 may include a machine learning algorithm, wherein a classified plurality of inputs 120 from posting 116 are machine learning algorithm inputs and the sub-quantifier as an algorithm output. The machine learning process may include training data from posting database 136, as described above. In some embodiments, training data may include elements from the disability criterion. For example, the algorithm may take inputs 120 classified in a job requirement posting category then, following the desirability criterion, output sub-quantifiers tailored to the job requirement posting category. The sub-quantifiers may be displayed as a percentage, number, and the like on user device 148. The total number of sub-quantifiers may then be combined using machines learning processes 124, such as a fuzzy inference system to give the overall quality metric 140 of posting category 128.

Still referring to FIG. 1 , machine-learning algorithms may include, without limitation, linear discriminant analysis. Machine-learning algorithm may include quadratic discriminate analysis. Machine-learning algorithms may include kernel ridge regression. Machine-learning algorithms may include support vector machines, including without limitation support vector classification-based regression processes. Machine-learning algorithms may include stochastic gradient descent algorithms, including classification and regression algorithms based on stochastic gradient descent. Machine-learning algorithms may include nearest neighbors algorithms. Machine-learning algorithms may include Gaussian processes such as Gaussian Process Regression. Machine-learning algorithms may include cross-decomposition algorithms, including partial least squares and/or canonical correlation analysis. Machine-learning algorithms may include naïve Bayes methods. Machine-learning algorithms may include algorithms based on decision trees, such as decision tree classification or regression algorithms. Machine-learning algorithms may include ensemble methods such as bagging meta-estimator, forest of randomized tress, AdaBoost, gradient tree boosting, and/or voting classifier methods. Machine-learning algorithms may include neural net algorithms, including convolutional neural net processes.

Still referring to FIG. 1 , machine-learning algorithms may include supervised machine-learning algorithms. Supervised machine learning algorithms, as defined herein, include algorithms that receive a training set relating a number of inputs to a number of outputs, and seek to find one or more mathematical relations relating inputs to outputs, where each of the one or more mathematical relations is optimal according to some criterion specified to the algorithm using some scoring function. For instance, a supervised learning algorithm may include a plurality of inputs from posting 116 as described above as inputs, posting categories as outputs, and a scoring function representing a desired form of relationship to be detected between inputs and outputs; scoring function may, for instance, seek to maximize the probability that a given input and/or combination of elements inputs is associated with a given output to minimize the probability that a given input is not associated with a given output. Scoring function may be expressed as a risk function representing an “expected loss” of an algorithm relating inputs to outputs, where loss is computed as an error function representing a degree to which a prediction generated by the relation is incorrect when compared to a given input-output pair provided in training data. Persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of various possible variations of supervised machine learning algorithms that may be used to determine relation between inputs and outputs.

Still referring to FIG. 1 . processor 104 and/or computing device 112 is configured to generate, as a function of quality metric 140, an ordering of posting 116, wherein order 144 relates to a probable level of focus a user may use to fill posting 116. As used in the disclosure, “ordering” is the ranking of datum in a posting. The focus level may be correlated to the level of interest a jobseeker may have in responding to posting 116. Measuring the level of focus may include, for example, evaluating interactions with posting 116. Evaluation may be based on the amount of time an applicant spent looking at posting 116, number of views and/or clicks, number of downloads and/or shares, amount of correct or incorrect formatted applicant responses, and the like. Additionally and/or alternatively, order 144 may also include calculating a cumulative score of posting 166 based on an aggregation of quality metric 140 for each posting category.

Still referring to FIG. 1 , Order 144 may be calculated using machine learning processes 124 as described throughout this disclosure, for example, a machine learning algorithm. In some embodiments, posting 116 may be an algorithm input and order 144 as an output. The algorithm training data include focus level measurements disclosed above, posting database 136, the desirability criterion, and the quality metrics/sub-quantifiers of posting 116. Order 144 may be outputted as a number on a scale, for example, a posting scale may range from 1-10, wherein 1, is a poor-quality posting, and 10 is a high-quality posting. Order 144 may also be displayed as a percentage and the like. In some embodiments order 144 may be displayed on user device 148, such as a smartphone, laptop, desktop, and the like. Order 144 may be utilized by a user to know which job postings to focus their energy and time on filling first and which ones may take longer to fill and may require a more in-depth search for a particular job candidate.

Still referring to FIG. 1 , as a function of a ordering, processor 104 and/or computing device 112 may be configured to generate improvements to posting 116 using a natural language module to identify a plurality of synonyms to a term, substitute a synonym of the plurality for the term, generate a new plurality of sub-quantifiers, and compare to the new plurality of sub-quantifiers to the original sub-quantifiers of posting 116. Processor 104 and/or computing device 112 may use machines learning processes 124, as described above, to establish a language processing model. For example, processor 104 and/or computing device 112 may take input from posting 116 with a job title “Beverage Dissemination Officer” and use a language processing model to identify other synonyms for the job title, such as “bartender”, “barkeep, “misologist” and the like. Processor 104 and/or computing device 112 may then substitute the input with the alternative job titles and recalculate a sub-quantifier for the job title posting category. Processor 104 and/or computing device 112 may then compare the new job title sub-quantifier to the original sub-quantifier and display to a user possible alternative for inputs 120 that would improve the overall quality metric 140 of posting category 128.

Still referring to FIG. 1 , a language processing module may include any hardware and/or software module. Language processing module may be configured to extract, from the one or more documents, one or more words. One or more words may include, without limitation, strings of one or more characters, including without limitation any sequence or sequences of letters, numbers, punctuation, diacritic marks, engineering symbols, geometric dimensioning and tolerancing (GD&T) symbols, chemical symbols and formulas, spaces, whitespace, and other symbols, including any symbols usable as textual data as described above. Textual data may be parsed into tokens, which may include a simple word (sequence of letters separated by whitespace) or more generally a sequence of characters as described previously. The term “token,” as used herein, refers to any smaller, individual groupings of text from a larger source of text; tokens may be broken up by word, pair of words, sentence, or other delimitation. These tokens may in turn be parsed in various ways. Textual data may be parsed into words or sequences of words, which may be considered words as well. Textual data may be parsed into “n-grams”, where all sequences of n consecutive characters are considered. Any or all possible sequences of tokens or words may be stored as “chains”, for example for use as a Markov chain or Hidden Markov Model.

Still referring to FIG. 1 , a language processing model may include a program automatically generated by processor 104 and/or computing device 112 and/or language processing module to produce associations between one or more words extracted from at least a document and detect associations, including without limitation mathematical associations, between such words. Associations between language elements, where language elements include for purposes herein extracted words, relationships of such categories to other such term may include, without limitation, mathematical associations, including without limitation statistical correlations between any language element and any other language element and/or language elements. Statistical correlations and/or mathematical associations may include probabilistic formulas or relationships indicating, for instance, a likelihood that a given extracted word indicates a given category of semantic meaning. As a further example, statistical correlations and/or mathematical associations may include probabilistic formulas or relationships indicating a positive and/or negative association between at least an extracted word and/or a given semantic meaning; positive or negative indication may include an indication that a given document is or is not indicating a category semantic meaning. Whether a phrase, sentence, word, or other textual element in a document or corpus of documents constitutes a positive or negative indicator may be determined, in an embodiment, by mathematical associations between detected words, comparisons to phrases and/or words indicating positive and/or negative indicators that are stored in memory 108 at processor 104 and/or computing device 112, or the like.

Still Referring to FIG. 1 , a language processing module may generate the language processing model by any suitable method, including without limitation a natural language processing classification algorithm; language processing model may include a natural language process classification model that enumerates and/or derives statistical relationships between input terms and output terms. Algorithm to generate language processing model may include a stochastic gradient descent algorithm, which may include a method that iteratively optimizes an objective function, such as an objective function representing a statistical estimation of relationships between terms, including relationships between input terms and output terms, in the form of a sum of relationships to be estimated. In an alternative or additional approach, sequential tokens may be modeled as chains, serving as the observations in a Hidden Markov Model (HMM). HMMs as used herein are statistical models with inference algorithms that that may be applied to the models. In such models, a hidden state to be estimated may include an association between an extracted words, phrases, and/or other semantic units. There may be a finite number of categories to which an extracted word may pertain; an HMM inference algorithm, such as the forward-backward algorithm or the Viterbi algorithm, may be used to estimate the most likely discrete state given a word or sequence of words. Language processing module may combine two or more approaches. For instance, and without limitation, machine-learning program may use a combination of Naive-Bayes (NB), Stochastic Gradient Descent (SGD), and parameter grid-searching classification techniques; the result may include a classification algorithm that returns ordered associations.

Still referring to FIG. 1 , generating language processing model may include generating a vector space, which may be a collection of vectors, defined as a set of mathematical objects that can be added together under an operation of addition following properties of associativity, commutativity, existence of an identity element, and existence of an inverse element for each vector, and can be multiplied by scalar values under an operation of scalar multiplication compatible with field multiplication, and that has an identity element is distributive with respect to vector addition, and is distributive with respect to field addition. Each vector in an n-dimensional vector space may be represented by an n-tuple of numerical values. Each unique extracted word and/or language element as described above may be represented by a vector of the vector space. In an embodiment, each unique extracted and/or other language element may be represented by a dimension of vector space; as a non-limiting example, each element of a vector may include a number representing an enumeration of co-occurrences of the word and/or language element represented by the vector with another word and/or language element. Vectors may be normalized, scaled according to relative frequencies of appearance and/or file sizes. In an embodiment associating language elements to one another as described above may include computing a degree of vector similarity between a vector representing each language element and a vector representing another language element; vector similarity may be measured according to any norm for proximity and/or similarity of two vectors, including without limitation cosine similarity, which measures the similarity of two vectors by evaluating the cosine of the angle between the vectors, which can be computed using a dot product of the two vectors divided by the lengths of the two vectors. Degree of similarity may include any other geometric measure of distance between vectors.

Still referring to FIG. 1 , language processing module may use a corpus of documents to generate associations between language elements in a language processing module, and diagnostic engine may then use such associations to analyze words extracted from one or more documents and determine that the one or more documents indicate significance of a category. In an embodiment, language module may perform this analysis using a selected set of significant documents, such as documents identified by one or more experts as representing good information; experts may identify or enter such documents via graphical user interface, or may communicate identities of significant documents according to any other suitable method of electronic communication, or by providing such identity to other persons who may enter such identifications into processor 104 and/or computing device 112. Documents may be entered into a computing device 112 by being uploaded by an expert or other persons using, without limitation, file transfer protocol (FTP) or other suitable methods for transmission and/or upload of documents; alternatively or additionally, where a document is identified by a citation, a uniform resource identifier (URI), uniform resource locator (URL) or other datum permitting unambiguous identification of the document, diagnostic engine may automatically obtain the document using such an identifier, for instance by submitting a request to a database or compendium of documents such as JSTOR as provided by Ithaka Harbors, Inc. of New York.

In some embodiments, processor 104 and/or computing device 112 may identify a plurality of deficiency categories of posting 116 using a plurality of sub-quantifiers. As used in this disclosure, a “deficiency category” is a category from a plurality of posting categories that is lacking in desirability to a job-seeker. In an embodiment, a deficiency category could display to a user that posting category 128 of posting 116 is severely lacking in substance, effecting quality metric 140. For example, the deficiency category could label a job title posting category with “Beverage Dissemination Officer” as non-desirable, confusing, poorly worded, and the like. In some embodiments, processor 104 and/or computing device 112 may receive a user update addressing any deficiencies. As used in this disclosure, a “user update” is a new set of inputs 120 amending or replacing the original set of inputs 120 of received posting 116 from a user. Processor 104 and/or computing device 112 may then recalculate quality metric 140 of posting category 128 based on the user update. As a result, processor 104 and/or computing device 112 may identify a new plurality of deficiency categories based on the user update. In some embodiments, this process of identifying deficiency categories, receiving user updates, recalculating, and re-identifying may be a step in the iteration as previously disclosed. Identifying a plurality of deficiency categories may include linguistic variable calculations using any machine learning process 124 as described throughout this disclosure. Additionally, and alternatively, identification may include sub-quantifier calculations as described above.

Referring now to FIG. 2 , an exemplary embodiment of a machine-learning module 200 that may perform one or more machine-learning processes as described in this disclosure is illustrated. Machine-learning module may perform determinations, classification, and/or analysis steps, methods, processes, or the like as described in this disclosure using machine learning processes. A “machine learning process,” as used in this disclosure, is a process that automatedly uses training data 204 to generate an algorithm that will be performed by a computing device/module to produce outputs 208 given data provided as inputs 212; this is in contrast to a non-machine learning software program where the commands to be executed are determined in advance by a user and written in a programming language.

Still referring to FIG. 2 , “training data,” as used herein, is data containing correlations that a machine-learning process may use to model relationships between two or more categories of data elements. For instance, and without limitation, training data 204 may include a plurality of data entries, each entry representing a set of data elements that were recorded, received, and/or generated together; data elements may be correlated by shared existence in a given data entry, by proximity in a given data entry, or the like. Multiple data entries in training data 204 may evince one or more trends in correlations between categories of data elements; for instance, and without limitation, a higher value of a first data element belonging to a first category of data element may tend to correlate to a higher value of a second data element belonging to a second category of data element, indicating a possible proportional or other mathematical relationship linking values belonging to the two categories. Multiple categories of data elements may be related in training data 204 according to various correlations; correlations may indicate causative and/or predictive links between categories of data elements, which may be modeled as relationships such as mathematical relationships by machine-learning processes as described in further detail below. Training data 204 may be formatted and/or organized by categories of data elements, for instance by associating data elements with one or more descriptors corresponding to categories of data elements. As a non-limiting example, training data 204 may include data entered in standardized forms by persons or processes, such that entry of a given data element in a given field in a form may be mapped to one or more descriptors of categories. Elements in training data 204 may be linked to descriptors of categories by tags, tokens, or other data elements; for instance, and without limitation, training data 204 may be provided in fixed-length formats, formats linking positions of data to categories such as comma-separated value (CSV) formats and/or self-describing formats such as extensible markup language (XML), JavaScript Object Notation (JSON), or the like, enabling processes or devices to detect categories of data.

Alternatively or additionally, and continuing to refer to FIG. 2 , training data 204 may include one or more elements that are not categorized; that is, training data 204 may not be formatted or contain descriptors for some elements of data. Machine-learning algorithms and/or other processes may sort training data 204 according to one or more categorizations using, for instance, natural language processing algorithms, tokenization, detection of correlated values in raw data and the like; categories may be generated using correlation and/or other processing algorithms. As a non-limiting example, in a corpus of text, phrases making up a number “n” of compound words, such as nouns modified by other nouns, may be identified according to a statistically significant prevalence of n-grams containing such words in a particular order; such an n-gram may be categorized as an element of language such as a “word” to be tracked similarly to single words, generating a new category as a result of statistical analysis. Similarly, in a data entry including some textual data, a person's name may be identified by reference to a list, dictionary, or other compendium of terms, permitting ad-hoc categorization by machine-learning algorithms, and/or automated association of data in the data entry with descriptors or into a given format. The ability to categorize data entries automatedly may enable the same training data 204 to be made applicable for two or more distinct machine-learning algorithms as described in further detail below. Training data 204 used by machine-learning module 200 may correlate any input data as described in this disclosure to any output data as described in this disclosure.

Further referring to FIG. 2 , training data may be filtered, sorted, and/or selected using one or more supervised and/or unsupervised machine-learning processes and/or models as described in further detail below; such models may include without limitation a training data classifier 216. Training data classifier 216 may include a “classifier,” which as used in this disclosure is a machine-learning model as defined below, such as a mathematical model, neural net, or program generated by a machine learning algorithm known as a “classification algorithm,” as described in further detail below, that sorts inputs into categories or bins of data, outputting the categories or bins of data and/or labels associated therewith. A classifier may be configured to output at least a datum that labels or otherwise identifies a set of data that are clustered together, found to be close under a distance metric as described below, or the like. Machine-learning module 200 may generate a classifier using a classification algorithm, defined as a process whereby a computing device and/or any module and/or component operating thereon derives a classifier from training data 204. Classification may be performed using, without limitation, linear classifiers such as without limitation logistic regression and/or naive Bayes classifiers, nearest neighbor classifiers such as k-nearest neighbors classifiers, support vector machines, least squares support vector machines, fisher's linear discriminant, quadratic classifiers, decision trees, boosted trees, random forest classifiers, learning vector quantization, and/or neural network-based classifiers.

Still referring to FIG. 2 , machine-learning module 200 may be configured to perform a lazy-learning process 220 and/or protocol, which may alternatively be referred to as a “lazy loading” or “call-when-needed” process and/or protocol, may be a process whereby machine learning is conducted upon receipt of an input to be converted to an output, by combining the input and training set to derive the algorithm to be used to produce the output on demand. For instance, an initial set of simulations may be performed to cover an initial heuristic and/or “first guess” at an output and/or relationship. As a non-limiting example, an initial heuristic may include a ordering of associations between inputs and elements of training data 204. Heuristic may include selecting some number of highest-ordering associations and/or training data 204 elements. Lazy learning may implement any suitable lazy learning algorithm, including without limitation a K-nearest neighbors algorithm, a lazy naïve Bayes algorithm, or the like; persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of various lazy-learning algorithms that may be applied to generate outputs as described in this disclosure, including without limitation lazy learning applications of machine-learning algorithms as described in further detail below.

Alternatively or additionally, and with continued reference to FIG. 2 , machine-learning processes as described in this disclosure may be used to generate machine-learning models 224. A “machine-learning model,” as used in this disclosure, is a mathematical and/or algorithmic representation of a relationship between inputs and outputs, as generated using any machine-learning process including without limitation any process as described above and stored in memory 108; an input is submitted to a machine-learning model 224 once created, which generates an output based on the relationship that was derived. For instance, and without limitation, a linear regression model, generated using a linear regression algorithm, may compute a linear combination of input data using coefficients derived during machine-learning processes to calculate an output datum. As a further non-limiting example, a machine-learning model 224 may be generated by creating an artificial neural network, such as a convolutional neural network comprising an input layer of nodes, one or more intermediate layers, and an output layer of nodes. Connections between nodes may be created via the process of “training” the network, in which elements from a training data 204 set are applied to the input nodes, a suitable training algorithm (such as Levenberg-Marquardt, conjugate gradient, simulated annealing, or other algorithms) is then used to adjust the connections and weights between nodes in adjacent layers of the neural network to produce the desired values at the output nodes. This process is sometimes referred to as deep learning.

Still referring to FIG. 2 , machine-learning algorithms may include at least a supervised machine-learning process 228. At least a supervised machine-learning process 228, as defined herein, include algorithms that receive a training set relating a number of inputs to a number of outputs, and seek to find one or more mathematical relations relating inputs to outputs, where each of the one or more mathematical relations is optimal according to some criterion specified to the algorithm using some scoring function. For instance, a supervised learning algorithm may include inputs and outputs as described above in this disclosure, and a scoring function representing a desired form of relationship to be detected between inputs and outputs; scoring function may, for instance, seek to maximize the probability that a given input and/or combination of elements inputs is associated with a given output to minimize the probability that a given input is not associated with a given output. Scoring function may be expressed as a risk function representing an “expected loss” of an algorithm relating inputs to outputs, where loss is computed as an error function representing a degree to which a prediction generated by the relation is incorrect when compared to a given input-output pair provided in training data 204. Persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of various possible variations of at least a supervised machine-learning process 228 that may be used to determine relation between inputs and outputs. Supervised machine-learning processes may include classification algorithms as defined above.

Further referring to FIG. 2 , machine learning processes may include at least an unsupervised machine-learning processes 232. An unsupervised machine-learning process, as used herein, is a process that derives inferences in datasets without regard to labels; as a result, an unsupervised machine-learning process may be free to discover any structure, relationship, and/or correlation provided in the data. Unsupervised processes may not require a response variable; unsupervised processes may be used to find interesting patterns and/or inferences between variables, to determine a degree of correlation between two or more variables, or the like.

Still referring to FIG. 2 , machine-learning module 200 may be designed and configured to create a machine-learning model 224 using techniques for development of linear regression models. Linear regression models may include ordinary least squares regression, which aims to minimize the square of the difference between predicted outcomes and actual outcomes according to an appropriate norm for measuring such a difference (e.g. a vector-space distance norm); coefficients of the resulting linear equation may be modified to improve minimization. Linear regression models may include ridge regression methods, where the function to be minimized includes the least-squares function plus term multiplying the square of each coefficient by a scalar amount to penalize large coefficients. Linear regression models may include least absolute shrinkage and selection operator (LASSO) models, in which ridge regression is combined with multiplying the least-squares term by a factor of 1 divided by double the number of samples. Linear regression models may include a multi-task lasso model wherein the norm applied in the least-squares term of the lasso model is the Frobenius norm amounting to the square root of the sum of squares of all terms. Linear regression models may include the elastic net model, a multi-task elastic net model, a least angle regression model, a LARS lasso model, an orthogonal matching pursuit model, a Bayesian regression model, a logistic regression model, a stochastic gradient descent model, a perceptron model, a passive aggressive algorithm, a robustness regression model, a Huber regression model, or any other suitable model that may occur to persons skilled in the art upon reviewing the entirety of this disclosure. Linear regression models may be generalized in an embodiment to polynomial regression models, whereby a polynomial equation (e.g. a quadratic, cubic or higher-order equation) providing a best predicted output/actual output fit is sought; similar methods to those described above may be applied to minimize error functions, as will be apparent to persons skilled in the art upon reviewing the entirety of this disclosure.

Continuing to refer to FIG. 2 , machine-learning algorithms may include, without limitation, linear discriminant analysis. Machine-learning algorithm may include quadratic discriminate analysis. Machine-learning algorithms may include kernel ridge regression. Machine-learning algorithms may include support vector machines, including without limitation support vector classification-based regression processes. Machine-learning algorithms may include stochastic gradient descent algorithms, including classification and regression algorithms based on stochastic gradient descent. Machine-learning algorithms may include nearest neighbors algorithms. Machine-learning algorithms may include various forms of latent space regularization such as variational regularization. Machine-learning algorithms may include Gaussian processes such as Gaussian Process Regression. Machine-learning algorithms may include cross-decomposition algorithms, including partial least squares and/or canonical correlation analysis. Machine-learning algorithms may include naïve Bayes methods. Machine-learning algorithms may include algorithms based on decision trees, such as decision tree classification or regression algorithms. Machine-learning algorithms may include ensemble methods such as bagging meta-estimator, forest of randomized tress, AdaBoost, gradient tree boosting, and/or voting classifier methods. Machine-learning algorithms may include neural net algorithms, including convolutional neural net processes.

Referring now to FIG. 3 , an exemplary embodiment of neural network 300 is illustrated. A neural network 300 also known as an artificial neural network, is a network of “nodes,” or data structures having one or more inputs, one or more outputs, and a function determining outputs based on inputs. Such nodes may be organized in a network, such as without limitation a convolutional neural network, including an input layer of nodes 304, one or more intermediate layers 308, and an output layer of nodes 312. Connections between nodes may be created via the process of “training” the network, in which elements from a training dataset are applied to the input nodes, a suitable training algorithm (such as Levenberg-Marquardt, conjugate gradient, simulated annealing, or other algorithms) is then used to adjust the connections and weights between nodes in adjacent layers of the neural network to produce the desired values at the output nodes. This process is sometimes referred to as deep learning. Connections may run solely from input nodes toward output nodes in a “feed-forward” network, or may feed outputs of one layer back to inputs of the same or a different layer in a “recurrent network.” As a further non-limiting example, a neural network may include a convolutional neural network comprising an input layer of nodes, one or more intermediate layers, and an output layer of nodes. A “convolutional neural network,” as used in this disclosure, is a neural network in which at least one hidden layer is a convolutional layer that convolves inputs to that layer with a subset of inputs known as a “kernel,” along with one or more additional layers such as pooling layers, fully connected layers, and the like.

Referring now to FIG. 4 , an exemplary embodiment of a node of a neural network is illustrated. A node may include, without limitation a plurality of inputs x; that may receive numerical values from inputs to a neural network containing the node and/or from other nodes. Node may perform a weighted sum of inputs using weights w, that are multiplied by respective inputs xi. Additionally or alternatively, a bias b may be added to the weighted sum of the inputs such that an offset is added to each unit in the neural network layer that is independent of the input to the layer. The weighted sum may then be input into a function p, which may generate one or more outputs y. Weight w, applied to an input x; may indicate whether the input is “excitatory,” indicating that it has strong influence on the one or more outputs y, for instance by the corresponding weight having a large numerical value, and/or a “inhibitory,” indicating it has a weak effect influence on the one more inputs y, for instance by the corresponding weight having a small numerical value. The values of weights w, may be determined by training a neural network using training data, which may be performed using any suitable process as described above.

Referring to FIG. 5 , an exemplary embodiment of fuzzy set comparison 500 is illustrated. A first fuzzy set 504 may be represented, without limitation, according to a first membership function 508 representing a probability that an input falling on a first range of values 512 is a member of the first fuzzy set 504, where the first membership function 508 has values on a range of probabilities such as without limitation the interval [0,1], and an area beneath the first membership function 508 may represent a set of values within first fuzzy set 504. Although first range of values 512 is illustrated for clarity in this exemplary depiction as a range on a single number line or axis, first range of values 512 may be defined on two or more dimensions, representing, for instance, a Cartesian product between a plurality of ranges, curves, axes, spaces, dimensions, or the like. First membership function 508 may include any suitable function mapping first range 512 to a probability interval, including without limitation a triangular function defined by two linear elements such as line segments or planes that intersect at or below the top of the probability interval. As a non-limiting example, triangular membership function may be defined as:

${y\left( {x,a,b,c} \right)} = \left\{ \begin{matrix} {0,{{{for}x} > {c{and}x} < a}} \\ {\frac{x - a}{b - a},\ {{{for}{\ }a} \leq x < b}} \\ {\frac{c - x}{c - b},\ {{{if}\ b} < x \leq c}} \end{matrix} \right.$

a trapezoidal membership function may be defined as:

${y\left( {x,a,b,c,d} \right)} = {\max\left( {{\min\ \left( {\frac{x - a}{b - a},1,\frac{d - x}{d - c}} \right)},0} \right)}$

a sigmoidal function may be defined as:

${y\left( {x,a,c} \right)} = \frac{1}{1 - e^{- {a({x - c})}}}$

a Gaussian membership function may be defined as:

${y\left( {x,c,\sigma} \right)} = e^{{- \frac{1}{2}}{(\frac{x - c}{\sigma})}^{2}}$

and a bell membership function may be defined as:

${y\left( {x,a,b,c,} \right)} = \left\lbrack {1 + {❘\frac{x - c}{a}❘}^{2b}} \right\rbrack^{- 1}$

Persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of various alternative or additional membership functions that may be used consistently with this disclosure.

Still referring to FIG. 5 , first fuzzy set 504 may represent any value or combination of values as described above, including output from one or more processes (e.g., machine-learning models), plurality of inputs from a posting, and sub-quantifiers from posting categories. A second fuzzy set 516, which may represent any value which may be represented by first fuzzy set 504, may be defined by a second membership function 520 on a second range 524; second range 524 may be identical and/or overlap with first range 512 and/or may be combined with first range via Cartesian product or the like to generate a mapping permitting evaluation overlap of first fuzzy set 504 and second fuzzy set 516. Where first fuzzy set 504 and second fuzzy set 516 have a region 528 that overlaps, first membership function 508 and second membership function 520 may intersect at a point 532 representing a probability, as defined on probability interval, of a match between first fuzzy set 504 and second fuzzy set 516. Alternatively or additionally, a single value of first and/or second fuzzy set may be located at a locus 536 on first range 512 and/or second range 524, where a probability of membership may be taken by evaluation of first membership function 508 and/or second membership function 520 at that range point. A probability at 528 and/or 532 may be compared to a threshold 540 to determine whether a positive match is indicated. Threshold 540 may, in a non-limiting example, represent a degree of match between first fuzzy set 504 and second fuzzy set 516, and/or single values therein with each other or with either set, which is sufficient for purposes of the matching process; for instance, threshold may indicate a sufficient degree of overlap between an output from one or more machine-learning models and a predetermined class, such as without limitation sub-quantifiers of a posting category, for combination to occur as described above. Alternatively or additionally, each threshold may be tuned by a machine-learning and/or statistical process.

Further referring to FIG. 5 , in an embodiment, a degree of match between fuzzy sets may be used to classify inputs in a posting category with sub-quantifiers based on an element of a desirability criterion. For instance, if the inputs in a posting category have a fuzzy set matching an element of a desirability criterion fuzzy set by having a degree of overlap exceeding a threshold, processor 104 and/or computing device 112 may classify the inputs in the posting category with sub-quantifiers relating to adequacy in matching the element of the desirability criterion. Where multiple fuzzy matches are performed, degrees of match for each respective fuzzy set may be computed and aggregated through, for instance, addition, averaging, or the like, to determine an overall degree of match.

Still referring to FIG. 5 , in an embodiment, inputs in a posting category may be compared to multiple class fuzzy sets representing elements of and/or pertaining to a desirability criterion. For instance, inputs in a posting category may be represented by an individual fuzzy set that is compared to each of the multiple class fuzzy sets; and a degree of overlap exceeding a threshold between the individual fuzzy set and any of the multiple class fuzzy sets may cause processor 104 and/or computing device 112 to classify the inputs in a posting category with sub-quantifiers. For instance, in one embodiment there may be two class fuzzy sets, representing a first element of the desirability criterion and a second element of the desirability criterion. First element of the desirability criterion may have a first fuzzy set; second element of the desirability criterion may have a second fuzzy set; and inputs from a posting category may have an individual fuzzy set. Processor 104 and/or computing device 112, for example, may compare an individual fuzzy set with each of first fuzzy set and second fuzzy set, as described above, and classify a sub-quantifier based on the first and second fuzzy sets. Machine-learning methods as described throughout may, in a non-limiting example, generate coefficients used in fuzzy set equations as described above, such as without limitation x, c, and a of a Gaussian set as described above, as outputs of machine-learning methods. Likewise, subject-specific data may be used indirectly to determine a fuzzy set, as the fuzzy set may be derived from outputs of one or more machine-learning models that take the subject-specific data directly or indirectly as inputs. Although an exemplary application for fuzzy set matching is described above, fuzzy set matching may be used for any classifications or associations described within this disclosure.

Referring now to FIG. 6 , illustrated is a flow diagram of an exemplary method for rating the quality of a posting. As, previously defined in this disclosure, a “posting” is a job posting of an employer or hiring entity. Method includes using a computing device. Computing device may be any computing device referred in this disclosure, for example and with reference to FIG. 1 . At step 605, method includes using the computing device to acquire a plurality of inputs from at least a posting. As defined above, an “input” is an element of data contained within a posting. Inputs may include any inputs described throughout this disclosure, for example and with reference to FIG. 1 . For example, inputs from a posting, may include a job title, job requirements, salary, and geographic location. Acquiring the plurality of inputs may be achieved using any process described throughout this disclosure, for example, by using a language processing module as disclosed in FIG. 1 .

Still referring to FIG. 6 , at step 610, method includes using a computing device configured to classify a posting to a posting category as a function of a plurality of inputs. As defined above, the posting category may include any category described thought this disclosure. For example, and with reference to FIG. 1 , the posting categories may include job title, salary, location, experience, technological background, and the like. The computing device may perform determinations, classification, and/or analysis steps, methods, processes, or the like as described in this disclosure using machine learning processes. A machine learning process may include any machine learning process described throughout this disclosure, for example and with reference to FIGS. 1-4 .

Still referring to FIG. 6 , at step 615, method includes using a computing device configured to calculate a quality metric as a function of a posting category and a plurality of inputs, wherein the quality metric reflects a level of completeness regarding an arrangement of inputs in a posting. In some embodiments, calculating the quality metric includes using a machine learning process to calculate and combine a plurality of sub-quantifiers of the posting based on a desirability criterion, for example and with reference to FIGS. 1 and 2 . As defined and disclosed in FIG. 1 , a “desirability criterion” is a criterion that indicates the appeal of a posting to an applicant, wherein the applicant is a job seeker that would reply to the posting. For example, the desirability of the job posting may indicate salary, benefits, hours, location of the job posting compared to other comparable job postings. In some cases, the desirability of the posting may depend at least in part on the company that posted the posting. In some embodiments, the machine learning process may include a machine learning algorithm, wherein a classified plurality of inputs from the posting are machine learning algorithm inputs and the sub-quantifier as an algorithm output. The machine learning process may include training data from a posting database, as described above. In some embodiments, training data may include elements from the disability criterion. For example, the algorithm may take inputs classified in a job requirement posting category then, following the desirability criterion, output sub-quantifiers tailored to the job requirement posting category. The sub-quantifiers may be displayed as a percentage, number, and the like. The total number of sub-quantifiers may then be combined using a machine learning process, such as a fuzzy inference system to give the overall quality metric of a posting category.

Still referring to FIG. 6 , at step 620, method includes using a computing device configured to generate, as a function of the quality metric, an ordering of the posting, wherein the order relates to a probable level of focus a user may use to fill the posting. A disclosed in FIG. 1 , order is the cumulative score of a posting based on the quality metric of each posting category. Order may be outputted as a number on a scale, for example, a posting scale may range from 1-10, wherein 1, is a poor-quality posting, and 10 is a high-quality posting. Order may also be displayed as a percentage and the like. In some embodiments order may be displayed on a user device, such as a smartphone, laptop, desktop, and the like. Order may be utilized by a user to know which job postings to focus their energy and time on filling first and which ones may take longer to fill and may require a more in-depth search for a particular job candidate.

Still referring to FIG. 6 , method may include using a computing device configured to generate improvements to a posting, as a function of an ordering, using a natural language module to identify a plurality of synonyms to a term, substitute a synonym of the plurality for the term, generate a new plurality of sub-quantifiers, and compare to the new plurality of sub-quantifiers to the original sub-quantifiers of the posting. Computing device may use a machine learning process, as described above in FIG. 1 , to establish a language processing model. In some embodiments, the computing device may identify a plurality of deficiency categories of a posting using a plurality of sub-quantifiers. As defined in FIG. 1 , a “deficiency category” is a category from a plurality of posting categories pertaining to a reason why a posting may be lacking in desirability to a jobseeker. In an embodiment, a deficiency category could display to a user that a posting category of a posting is severely lacking in substance, effecting the quality metric. As defined in FIG. 1 , a “user update” is a new set of inputs amending or replacing the original set of inputs of a received posting from a user. The computing device may then recalculate the quality metric of the posting category based on the user update. The computing device may identify a new plurality of deficiency categories based on the user update. In some embodiments, this process of identifying deficiency categories, receiving user updates, recalculating, and re-identifying may be a step in the iteration. Identifying a plurality of deficiency categories may include linguistic variable calculations using any machine learning process as described throughout this disclosure, for example, a fuzzy inference system. Additionally, and alternatively, identification may include sub-quantifier calculations as described above.

Still referring to FIG. 6 , method may include a fuzzy inference system implemented according to input and/or output membership functions and/or linguistic variables. For instance, a first linguistic variable may represent a first measurable value pertaining to a posting category, such as a degree of deficiency of an element of posting data, while a second membership function may indicate a degree of desirability of a subject thereof, or another measurable value pertaining to a posting category. Continuing the example, an output linguistic variable may represent, without limitation, a deficiency score value. A deficiency score is the degree of deficiency in a posting category, wherein a deficiency threshold is compared to a posting. In some embodiments, a computing device may use a logic comparison program, such as, but not limited to, a fuzzy logic model to determine a deficiency score. A deficiency score may include, but is not limited to “desirable,” “acceptable,” “problematic,” “terrible,” and the like; each deficiency score may be represented as a value for a linguistic variable representing deficiency score, or in other words a fuzzy set as described above that corresponds to a degree of deficiency as calculated using any statistical, machine-learning, or other method that may occur to a person skilled in the art upon reviewing the entirety of this disclosure. In other words, a given element of deficiency assessment data may have a first non-zero value for membership in a first linguistic variable value such as “average,” and a second non-zero value for membership in a second linguistic variable value such as “desirable”. In some embodiments, a degree of membership in two overlapping sets may be used to generate a degree of deficiency in a posting category.

It is to be noted that any one or more of the aspects and embodiments described herein may be conveniently implemented using one or more machines (e.g., one or more computing devices that are utilized as a user computing device for an electronic document, one or more server devices, such as a document server, etc.) programmed according to the teachings of the present specification, as will be apparent to those of ordinary skill in the computer art. Appropriate software coding can readily be prepared by skilled programmers based on the teachings of the present disclosure, as will be apparent to those of ordinary skill in the software art. Aspects and implementations discussed above employing software and/or software modules may also include appropriate hardware for assisting in the implementation of the machine executable instructions of the software and/or software module.

Such software may be a computer program product that employs a machine-readable storage medium. A machine-readable storage medium may be any medium that is capable of storing and/or encoding a sequence of instructions for execution by a machine (e.g., a computing device) and that causes the machine to perform any one of the methodologies and/or embodiments described herein. Examples of a machine-readable storage medium include, but are not limited to, a magnetic disk, an optical disc (e.g., CD, CD-R, DVD, DVD-R, etc.), a magneto-optical disk, a read-only memory “ROM” device, a random access memory “RAM” device, a magnetic card, an optical card, a solid-state memory device, an EPROM, an EEPROM, and any combinations thereof. A machine-readable medium, as used herein, is intended to include a single medium as well as a collection of physically separate media, such as, for example, a collection of compact discs or one or more hard disk drives in combination with a computer memory. As used herein, a machine-readable storage medium does not include transitory forms of signal transmission.

Such software may also include information (e.g., data) carried as a data signal on a data carrier, such as a carrier wave. For example, machine-executable information may be included as a data-carrying signal embodied in a data carrier in which the signal encodes a sequence of instruction, or portion thereof, for execution by a machine (e.g., a computing device) and any related information (e.g., data structures and data) that causes the machine to perform any one of the methodologies and/or embodiments described herein.

Examples of a computing device include, but are not limited to, an electronic book reading device, a computer workstation, a terminal computer, a server computer, a handheld device (e.g., a tablet computer, a smartphone, etc.), a web appliance, a network router, a network switch, a network bridge, any machine capable of executing a sequence of instructions that specify an action to be taken by that machine, and any combinations thereof. In one example, a computing device may include and/or be included in a kiosk.

FIG. 7 shows a diagrammatic representation of one embodiment of a computing device in the exemplary form of a computer system 700 within which a set of instructions for causing a control system to perform any one or more of the aspects and/or methodologies of the present disclosure may be executed. It is also contemplated that multiple computing devices may be utilized to implement a specially configured set of instructions for causing one or more of the devices to perform any one or more of the aspects and/or methodologies of the present disclosure. Computer system 700 includes a processor 704 and a memory 708 that communicate with each other, and with other components, via a bus 712. Bus 712 may include any of several types of bus structures including, but not limited to, a memory bus, a memory controller, a peripheral bus, a local bus, and any combinations thereof, using any of a variety of bus architectures.

Processor 704 may include any suitable processor, such as without limitation a processor incorporating logical circuitry for performing arithmetic and logical operations, such as an arithmetic and logic unit (ALU), which may be regulated with a state machine and directed by operational inputs from memory and/or sensors; processor 704 may be organized according to Von Neumann and/or Harvard architecture as a non-limiting example. Processor 704 may include, incorporate, and/or be incorporated in, without limitation, a microcontroller, microprocessor, digital signal processor (DSP), Field Programmable Gate Array (FPGA), Complex Programmable Logic Device (CPLD), Graphical Processing Unit (GPU), general purpose GPU, Tensor Processing Unit (TPU), analog or mixed signal processor, Trusted Platform Module (TPM), a floating point unit (FPU), and/or system on a chip (SoC).

Memory 708 may include various components (e.g., machine-readable media) including, but not limited to, a random-access memory component, a read only component, and any combinations thereof. In one example, a basic input/output system 716 (BIOS), including basic routines that help to transfer information between elements within computer system 700, such as during start-up, may be stored in memory 708. Memory 708 may also include (e.g., stored on one or more machine-readable media) instructions (e.g., software) 720 embodying any one or more of the aspects and/or methodologies of the present disclosure. In another example, memory 708 may further include any number of program modules including, but not limited to, an operating system, one or more application programs, other program modules, program data, and any combinations thereof.

Computer system 700 may also include a storage device 724. Examples of a storage device (e.g., storage device 724) include, but are not limited to, a hard disk drive, a magnetic disk drive, an optical disc drive in combination with an optical medium, a solid-state memory device, and any combinations thereof. Storage device 724 may be connected to bus 712 by an appropriate interface (not shown). Example interfaces include, but are not limited to, SCSI, advanced technology attachment (ATA), serial ATA, universal serial bus (USB), IEEE 1394 (FIREWIRE), and any combinations thereof. In one example, storage device 724 (or one or more components thereof) may be removably interfaced with computer system 700 (e.g., via an external port connector (not shown)). Particularly, storage device 724 and an associated machine-readable medium 728 may provide nonvolatile and/or volatile storage of machine-readable instructions, data structures, program modules, and/or other data for computer system 700. In one example, software 720 may reside, completely or partially, within machine-readable medium 728. In another example, software 720 may reside, completely or partially, within processor 704.

Computer system 700 may also include an input device 732. In one example, a user of computer system 700 may enter commands and/or other information into computer system 700 via input device 732. Examples of an input device 732 include, but are not limited to, an alpha-numeric input device (e.g., a keyboard), a pointing device, a joystick, a gamepad, an audio input device (e.g., a microphone, a voice response system, etc.), a cursor control device (e.g., a mouse), a touchpad, an optical scanner, a video capture device (e.g., a still camera, a video camera), a touchscreen, and any combinations thereof. Input device 732 may be interfaced to bus 712 via any of a variety of interfaces (not shown) including, but not limited to, a serial interface, a parallel interface, a game port, a USB interface, a FIREWIRE interface, a direct interface to bus 712, and any combinations thereof. Input device 732 may include a touch screen interface that may be a part of or separate from display 736, discussed further below. Input device 732 may be utilized as a user selection device for selecting one or more graphical representations in a graphical interface as described above.

A user may also input commands and/or other information to computer system 700 via storage device 724 (e.g., a removable disk drive, a flash drive, etc.) and/or network interface device 740. A network interface device, such as network interface device 740, may be utilized for connecting computer system 700 to one or more of a variety of networks, such as network 744, and one or more remote devices 748 connected thereto. Examples of a network interface device include, but are not limited to, a network interface card (e.g., a mobile network interface card, a LAN card), a modem, and any combination thereof. Examples of a network include, but are not limited to, a wide area network (e.g., the Internet, an enterprise network), a local area network (e.g., a network associated with an office, a building, a campus or other relatively small geographic space), a telephone network, a data network associated with a telephone/voice provider (e.g., a mobile communications provider data and/or voice network), a direct connection between two computing devices, and any combinations thereof. A network, such as network 744, may employ a wired and/or a wireless mode of communication. In general, any network topology may be used. Information (e.g., data, software 720, etc.) may be communicated to and/or from computer system 700 via network interface device 740.

Computer system 700 may further include a video display adapter 752 for communicating a displayable image to a display device, such as display device 736. Examples of a display device include, but are not limited to, a liquid crystal display (LCD), a cathode ray tube (CRT), a plasma display, a light emitting diode (LED) display, and any combinations thereof. Display adapter 752 and display device 736 may be utilized in combination with processor 704 to provide graphical representations of aspects of the present disclosure. In addition to a display device, computer system 700 may include one or more other peripheral output devices including, but not limited to, an audio speaker, a printer, and any combinations thereof. Such peripheral output devices may be connected to bus 712 via a peripheral interface 756. Examples of a peripheral interface include, but are not limited to, a serial port, a USB connection, a FIREWIRE connection, a parallel connection, and any combinations thereof.

The foregoing has been a detailed description of illustrative embodiments of the invention. Various modifications and additions can be made without departing from the spirit and scope of this invention. Features of each of the various embodiments described above may be combined with features of other described embodiments as appropriate in order to provide a multiplicity of feature combinations in associated new embodiments. Furthermore, while the foregoing describes a number of separate embodiments, what has been described herein is merely illustrative of the application of the principles of the present invention. Additionally, although particular methods herein may be illustrated and/or described as being performed in a specific order, the ordering is highly variable within ordinary skill to achieve apparatuses and methods according to the present disclosure. Accordingly, this description is meant to be taken only by way of example, and not to otherwise limit the scope of this invention.

Exemplary embodiments have been disclosed above and illustrated in the accompanying drawings. It will be understood by those skilled in the art that various changes, omissions and additions may be made to that which is specifically disclosed herein without departing from the spirit and scope of the present invention. 

What is claimed is:
 1. An apparatus for rating the quality of a posting, the apparatus comprising: at least a processor; and a memory communicatively connected to the processor, the memory containing instructions configuring the at least a processor to: acquire a plurality of inputs from at least a posting associated with a job position; classify the at least a posting to a posting category as a function of the plurality of inputs; calculate a quality metric as a function of the posting category and the plurality of inputs, wherein: the quality metric reflects a level of completeness regarding the arrangement of inputs in a posting; and generate, as a function of the quality metric, an ordering of the at least a posting, wherein the ordering relates to a probable level of focus.
 2. The apparatus of claim 1, wherein the plurality of inputs comprises data related to job requirements.
 3. The apparatus of claim 1, wherein acquiring the plurality of inputs includes using a natural language processing module to extract data from the posting.
 4. The apparatus of claim 1, wherein the memory contains instructions further configuring the processor to determine a desirability criterion as a function of the plurality of inputs.
 5. The apparatus of claim 4, wherein the plurality of inputs comprises a salary of the job position.
 6. The apparatus of claim 4, wherein calculating the quality metric further comprises combining a plurality of sub-qualifiers of the posting as a function of the desirability criterion.
 7. The apparatus of claim 1, wherein the memory contains instructions further configuring the processor to identify a plurality of deficiency categories of the at least a posting as a function of a plurality of sub-quantifiers.
 8. The apparatus of claim 1, wherein the memory contains instructions further configuring the at least a processor to recalculate the quality metric of the at least a posting based on a user update.
 9. The apparatus of claim 8, wherein the memory contains instructions further configuring the at least a processor to identify a new plurality of deficiency categories based on the user update.
 10. The apparatus of claim 1, wherein the memory contains instructions further configuring the processor to measure the probable level of focus of the posting as a function of an amount of time the jobseeker spends reviewing the posting, wherein the probable level of focus comprises a probability that a jobseeker will respond to the posting.
 11. A method for rating the quality of a posting, the method comprising: acquiring, using at least a processor, a plurality of inputs from at least a posting associated with a job position; classifying, using the at least a processor, the at least a posting to a posting category as a function of the plurality of inputs; calculating, using the at least a processor, a quality metric as a function of the posting category and the plurality of inputs, wherein: the quality metric reflects a level of completeness regarding the arrangement of inputs in a posting; and generating, using the at least a processor, as a function of the quality metric, an ordering of the at least a posting wherein the order relates to a probable level of focus
 12. The method of claim 11, wherein the plurality of inputs comprises data related to job requirements.
 13. The method of claim 11, wherein acquiring the plurality of inputs comprises using a natural language processing module to extract data from the posting.
 14. The method of claim 11, further comprising determining, by the at least a processor, a desirability criterion as a function of the plurality of inputs.
 15. The method of claim 14, wherein the plurality of inputs comprises a salary of the job position.
 16. The method of claim 14, wherein calculating the quality metric further comprises combining a plurality of sub-qualifiers of the posting as a function of the desirability criterion.
 17. The method of claim 11, further comprising identifying, by the at least a processor, a plurality of deficiency categories of the at least a posting as a function of a plurality of sub-quantifiers.
 18. The method of claim 11, further comprising recalculating, by the at least a processor, the quality metric of the at least a posting based on a user update.
 19. The method of claim 18, further comprising identifying, by the at least a processor, a new plurality of deficiency categories based on the user update.
 20. The method of claim 11, further comprising measuring, by the at least a processor, the level of focus of the posting as a function of an amount of time the jobseeker spends reviewing the posting, wherein the probable level of focus comprises a probability that a jobseeker will respond to the posting. 